A two-phase approach for real-world train unit scheduling
نویسندگان
چکیده
منابع مشابه
A two-phase approach for real-world train unit scheduling
A two-phase approach for the train unit scheduling problem is proposed. The first phase assigns and sequences train trips to train units temporarily ignoring some station infrastructure details. Real-world scenarios such as compatibility among traction types and banned/restricted locations and time allowances for coupling/decoupling are considered. Its solutions would be near-operable. The seco...
متن کاملSolving a Real-World Train Unit Assignment Problem
We face a real-world train unit assignment problem for an operator running trains in a regional area. Given a set of timetabled train trips, each with a required number of passenger seats, and a set of train units, each with a given number of available seats, the problem calls for an assignment of the train units to trips, possibly combining more than one train unit for a given trip, that fulfi...
متن کاملTrain Scheduling Problem - Phase II: A Simulation Integrated Genetic AlgorithmSystem
In [1] a feasible timetable generator stochastic simulation modeling framework for the train scheduling problem was developed to obtain a train timetable which includes train arrival and departure times at all visited stations and calculated average train travel time for all trains in the system. In this study, the framework is integrated with a genetic algorithm (GA) in order to get an optimal...
متن کاملTrain Scheduling Problem - Phase I: A General Simulation Modeling Framework
One of the important problems in management of railway systems is train scheduling problem. This is the problem of determining a timetable for a set of trains that do not violate infrastructure capacities and satisfies some operational constraints. In this study, a feasible timetable generator framework for stochastic simulation modeling is developed. The objective is to obtain a feasible tr...
متن کاملA Two-Phase Approach to Predictably Scheduling Real-Time Transactions
We consider the problem of designing a database system that schedules ACID transactions to meet real-time deadlines. Two complementary algorithms are proposed, valid for a large class of applications, that minimize the unproductive data contention and limit to one the number of transaction aborts and subsequent retries arising from achieving serializability in concurrent execution. This is a cr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Public Transport
سال: 2013
ISSN: 1866-749X,1613-7159
DOI: 10.1007/s12469-013-0073-9